Symbolic Computations based on Grid Services
نویسندگان
چکیده
منابع مشابه
Symbolic Computations based on Grid Services
The widespread adoption of the current Grid technologies is still impeded by a number of problems, one of which is difficulty of developing and implementing Grid-enabled applications. In another dimension, symbolic computation, aiming to automatize the steps of mathematical problem solving, has become in the last years a basis for advanced applications in many areas of computer science. In this...
متن کاملSymbolic Computations as Grid and Web Services
Modern symbolic computations increasingly require infrastructure for implementing parallel algorithms and combining capabilities available in several different systems. Moreover, there are growing numbers of symbolic computation resources, such as databases or specialized software which could be made available as Web services or Grid services accessible over the Internet. The EU Framework VI pr...
متن کاملSurvey of Symbolic Computations on the Grid
Symbolic and algebraic computations are one of the fastest growing areas of scientific computing. In this paper we present an overview of the state-of-the-art in symbolic and algebraic computations on parallel and distributed computers and on grids. We give some background information, including typical application areas, and then give a list of past and on-going projects involving symbolic com...
متن کاملPattern Based Composition of Web Services for Symbolic Computations
The suitability of the BPEL workflow description language for the dynamic composition of Web services representing computational algebra systems is investigated. The prototype implementation of the system for dynamic generation of BPEL workflows and two examples demonstrating the benefits of our approach are described. One of important aspects of the design is that the composition is achieved u...
متن کاملOn Graph-based Cryptography and Symbolic Computations
We have been investigating the cryptographical properties of infinite families of simple graphs of large girth with the special colouring of vertices during the last 10 years. Such families can be used for the development of cryptographical algorithms (on symmetric or public key modes) and turbocodes in error correction theory. Only few families of simple graphs of large unbounded girth and arb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computers Communications & Control
سال: 2006
ISSN: 1841-9836,1841-9836
DOI: 10.15837/ijccc.2006.1.2270